منابع مشابه
Generating SIMD Vectorized Permutations
This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These permutations are crucial for highperformance numerical kernels including the fast Fourier transform. Our generator takes as input only the specification of the target platform’s SIMD vector ISA and the desired permutation. The...
متن کاملGenerating Permutations and Combinations
We consider permutations of {1, 2, . . . , n} in which each integer is given a direction; such permutations are called directed permutations. An integer k in a directed permutation is called mobile of its arrow points to a smaller integer adjacent to it. For example, for → 3 → 2 ← 5 → 4 → 6 → 1 , the integers 3, 5, and 6 are mobile. It follows that 1 can never be mobile since there is no intege...
متن کاملGenerating Permutations with k-Differences
Given (n; k) with n k 2 and k 6 = 3, we show how to generate all permutations of n objects (each exactly once) so that successive permutations diier in exactly k positions, as do the rst and last permutations. This solution generalizes known results for the speciic cases where k = 2 and k = n. When k = 3, we show that it is possible to generate all even (odd) permutations of n objects so that s...
متن کاملGenerating trees for permutations avoiding generalized patterns
We construct generating trees with with one and two labels for some classes of permutations avoiding generalized patterns of length 3 and 4. These trees are built by adding at each level an entry to the right end of the permutation, instead of inserting always the largest entry. This allows us to incorporate the adjacency condition about some entries in an occurrence of a generalized pattern. W...
متن کاملSimple permutations and algebraic generating functions
A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We extend this result to enumerate permutations in such a class satisfying additional properties, e.g., the even permutations, the involutions, the permutations av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1986
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90121-4